Graph-theoretic Hurwitz Groups
نویسنده
چکیده
This paper studies the analogue of Hurwitz groups and surfaces in the context of harmonic group actions on finite graphs. Our main result states that maximal graph groups are exactly the finite quotients of the modular group Γ = 〈 x, y | x2 = y3 = 1 〉 of size at least 6. As an immediate consequence, every Hurwitz group is a maximal graph group, and the final section of the paper establishes a direct connection between maximal graphs and Hurwitz surfaces via a construction due to Brooks and Makover.
منابع مشابه
Genus 0 and 1 Hurwitz Numbers : Recursions , Formulas , and Graph - Theoretic Interpretations Ravi
We derive a closed-form expression for all genus 1 Hurwitz numbers, and give a simple new graph-theoretic interpretation of Hurwitz numbers in genus 0 and 1. (Hurwitz numbers essentially count irreducible genus g covers of the sphere, with arbitrary specified branching over one point, simple branching over other specified points, and no other branching. The problem is equivalent to counting tra...
متن کاملFormulas, and Graph-theoretic Interpretations
We derive a closed-form expression for all genus 1 Hurwitz numbers, and give a simple new graph-theoretic interpretation of Hurwitz numbers in genus 0 and 1. (Hurwitz numbers essentially count irreducible genus g covers of the sphere, with arbitrary specified branching over one point, simple branching over other specified points, and no other branching. The problem is equivalent to counting tra...
متن کاملRecursions, Formulas, and Graph-theoretic Interpretations of Ramified Coverings of the Sphere by Surfaces of Genus
We derive a closed-form expression for all genus 1 Hurwitz numbers, and give a simple new graph-theoretic interpretation of Hurwitz numbers in genus 0 and 1. (Hurwitz numbers essentially count irreducible genus g covers of the sphere, with arbitrary specified branching over one point, simple branching over other specified points, and no other branching. The problem is equivalent to counting tra...
متن کاملGraph Theoretic Method for Determining non- Hurwitz Equivalence in the Braid Group and Symmetric group
Motivated by the problem of Hurwitz equivalence of ∆ factorization in the braid group, we address the problem of Hurwitz equivalence in the symmetric group, obtained by projecting the ∆ factorizations into Sn. We get 1Sn factorizations with transposition factors. Looking at the transpositions as the edges in a graph, we show that two factorizations are Hurwitz equivalent if and only if their gr...
متن کاملTHE ORDER GRAPHS OF GROUPS
Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...
متن کامل